class Solution:
def maxProduct(self, words: List[str]) -> int:
a = []
for i in range(len(words)):
d = {}
for j in range(len(words[i])):
if words[i][j] in d:
d[words[i][j]] +=1
else:
d[words[i][j]] = 1
a.append(d)
ans = 0
for i in range(len(a)):
for j in range(i+1 ,len(a) , 1):
flag = 0
for k in a[i]:
if k in a[j]:
flag = 1
break
if flag == 0:
ans = max(ans, len(words[i]) * len(words[j]))
return ans
34. Find First and Last Position of Element in Sorted Array | 33. Search in Rotated Sorted Array |
17. Letter Combinations of a Phone Number | 5. Longest Palindromic Substring |
3. Longest Substring Without Repeating Characters | 1312. Minimum Insertion Steps to Make a String Palindrome |
1092. Shortest Common Supersequence | 1044. Longest Duplicate Substring |
1032. Stream of Characters | 987. Vertical Order Traversal of a Binary Tree |
952. Largest Component Size by Common Factor | 212. Word Search II |
174. Dungeon Game | 127. Word Ladder |
123. Best Time to Buy and Sell Stock III | 85. Maximal Rectangle |
84. Largest Rectangle in Histogram | 60. Permutation Sequence |
42. Trapping Rain Water | 32. Longest Valid Parentheses |
Cutting a material | Bubble Sort |
Number of triangles | AND path in a binary tree |
Factorial equations | Removal of vertices |
Happy segments | Cyclic shifts |
Zoos | Build a graph |